Intuitionistic Hypothetical Logic of Proofs
نویسندگان
چکیده
We study a term assignment for an intuitonistic fragment of the Logic of Proofs (LP). LP is a refinement of modal logic S4 in which the assertion 2A is replaced by [[s]]A whose intended reading is “s is a proof of A”. We first introduce a natural deduction presentation based on hypothetical judgements and then its term assignment, which yields a confluent and strongly normalising typed lambda calculus λ . This work is part of an ongoing effort towards reformulating LP in terms of hypothetical reasoning in order to explore its applications in programming languages.
منابع مشابه
Truth Values and Connectives in Some Non-Classical Logics
The question as to whether the propositional logic of Heyting, which was a formalization of Brouwer's intuitionistic logic, is finitely many valued or not, was open for a while (the question was asked by Hahn). Kurt Gödel (1932) introduced an infinite decreasing chain of intermediate logics, which are known nowadays as Gödel logics, for showing that the intuitionistic logic is not finitely (man...
متن کاملA pragmatic framework for intuitionistic modalities: Classical logic and Lax logic
We reconsider Dalla Pozza and Garola pragmatic interpretation of intuitionistic logic [13] where sentences and proofs formalize assertions and their justifications and revise it so that the costruction is done within an intuitionistic metatheory. We reconsider also the extension of Dalla Pozza and Garola’a approach to cointuitionistic logic, seen as a logic of hypotheses [5, 9, 4] and the duali...
متن کاملHypothetical Logic of Proofs
The Logic of Proofs (LP) [2–5] is a refinement of modal logic introduced by Artemov in 1995 which has recently been proposed for explaining well-known paradoxes arising in the formalization of Epistemic Logic. Assertions of knowledge and belief are accompanied by justifications: the formula [[t]]A states that proof witness t is “reason” for knowing/believing A. Also, LP is capable of reflecting...
متن کاملFrom de Jongh’s theorem to intuitionistic logic of proofs
The famous de Jongh’s theorem of 1970 stated that the intuitionistic logic captured all the logical formulas which have all arithmetical instances derivable in the Heyting Arithmetic HA. In this note we extend de Jongh’s arithmetical completeness property from IPC to the basic intuitionistic logic of proofs, which allows proof assertion statements of the sort x is a proof of F. The logic of pro...
متن کاملA Logic for Hypothetical Reasoning
This paper shows that classical logic is inappropriate for hypothetical reasoning and develops an alternative logic for this purpose. The paper focuses on a form of hypothetical reasoning which appears computationally tractable. Specifically, Horn-clause logic is augmented with rules, called embedded implications, which can hypothetically add atomic formulas to a rulebase. By introducing the no...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electr. Notes Theor. Comput. Sci.
دوره 300 شماره
صفحات -
تاریخ انتشار 2014